Guarding orthogonal art galleries with sliding cameras
نویسندگان
چکیده
منابع مشابه
Guarding orthogonal art galleries with sliding cameras
Let P be an orthogonal polygon with n vertices. A sliding camera travels back and forth along an orthogonal line segment s ⊆ P corresponding to its trajectory. The camera sees a point p ∈ P if there is a point q ∈ s such that pq is a line segment normal to s that is completely contained in P . In the MinimumCardinality Sliding Cameras (MCSC) problem, the objective is to find a set S of sliding ...
متن کاملGuarding Orthogonal Art Galleries with Sliding Cameras
We study the problem of guarding an orthogonal art gallery with security cameras sliding back and forth along straight tracks. We show that if only vertical (alternatively, horizontal) tracks are allowed, then a solution minimizing the number of tracks can be found in polynomial time, and if both orientations are allowed, then a 3-approximation can be found in polynomial time.
متن کاملGuarding Monotone Art Galleries with Sliding Cameras in Linear Time
A sliding camera in an orthogonal polygon P is a point guard g that travels back and forth along an orthogonal line segment s inside P . A point p in P is guarded by g if and only if there exists a point q on s such that line segment pq is normal to s and contained in P . In the minimum sliding cameras (MSC) problem, the objective is to guard P with the minimum number of sliding cameras. We giv...
متن کاملA 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras
A sliding camera travelling along a line segment s in a polygon P can see a point p in P if and only if p lies on a line segment contained in P that intersects s at a right angle. The objective of the minimum sliding cameras (MSC) problem is to guard P with the fewest sliding cameras possible, each of which is a horizontal or vertical line segment. In this paper, we give an O(n)-time 3-approxim...
متن کاملA (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras
Consider a sliding camera that travels back and forth along an orthogonal line segment s inside an orthogonal polygon P with n vertices. The camera can see a point p inside P if and only if there exists a line segment containing p that crosses s at a right angle and is completely contained in P . In the minimum sliding cameras (MSC) problem, the objective is to guard P with the minimum number o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2017
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2017.04.001